Decentralized Dynamic Processes for Finding Equilibrium
نویسنده
چکیده
This paper describes a class of decentralized dynamic processes designed to converge to equilibrium when the equilibrium equations are linear. These processes can also be viewed as distributed algorithms for solving systems of linear equations, or as learning algorithms. The class includes processes that use a message space larger by one binary digit than the space in which the equilibrium exists. However, memory and time requirements increase exponentially with the number of agents (equations). Journal of Economic Literature Classification Number: 021.
منابع مشابه
A decentralized multi-level leader-follower game for network design of a competitive supply chain
This paper develops a decentralized leader-follower game for network design of a competitive supply chain problem in which a new chain as the leader enters a market with one existing supply chain as a follower. Both chains produce an identical product, customer demand is inelastic and customer utility function is based on Huff gravity-based model. The leader wants to shape his network and set a...
متن کاملSimultaneous Decentralized Competitive Supply Chain Network Design under Oligopoly Competition
This paper discusses a problem in which decentralized supply chains enter the market simultaneously with no existing rival chains, shape the supply chains’ networks, and set wholesale and retail prices in a noncooperative manner. All the chains produce either identical or highly substitutable products. Customer demand is elastic and price-dependent. A three-step algorithm is proposed to solve ...
متن کاملDynamic Load Balancing Policy with Communication and Computation Elements in Grid Computing with Multi-Agent System Integration
The policy in dynamic load balancing, classification and function are variety based on the focus study for each research. They are different but employing the same strategy to obtain the load balancing. The communication processes between policies are explored within the dynamic load balancing and decentralized approaches. At the same time the computation processes also take into consideration ...
متن کاملAn Approximate Dynamic Programming Approach to Decentralized Control of Stochastic Systems
In this paper we consider the problem of computing decentralized control policies for stochastic systems with finite state and action spaces. Synthesis of optimal decentralized policies for such problems is known to be NP-hard [15]. Here we focus on methods for efficiently computing meaningful suboptimal decentralized control policies. The algorithms we present here are based on approximation o...
متن کاملA dynamic Stackelberg game for green supply chain management
In this paper, we establish a dynamic game to allocate CSR (Corporate Social Responsibility) to the members of a supply chain. We propose a model of a three-tier supply chain in a decentralized state which includes a supplier, a manufacturer and a retailer. For analyzing supply chain performance in decentralized state and the relationships between the members of the supply chain, we use a Stack...
متن کامل